Partial Evaluation for Hierarchies of Logic Theories
نویسندگان
چکیده
We discuss the impact of Partial Evaluation within the framework of structured logic programming. We define a general scheme for Partial Evaluation to be applied to a wide class of structuring policies for logic programming, capable of supporting both blockand inheritancebased systems. We show how the properties of soundness and completeness of Partial Evaluation in Logic Programming are preserved in this extended scheme.
منابع مشابه
Generalized amalgamation and n-simplicity
We study generalized amalgamation properties in simple theories. We state the definition of generalized amalgamation in such a way so that the properties are preserved under interpreted theories. To deal with the properties, new notions of generalized types and generalized Morley sequences are introduced. We consider several sub-hierarchies of simple theories that affect generalized amalgamatio...
متن کاملUnifying Theories of Undefinedness in UTP
In previous work, based on an original idea due to Saaltink, we proposed a unifying theory of undefined expressions in logics used for formally specifying software systems. In our current paper, we instantiate these ideas in Hoare and He’s Unifying Theories of Programming, with each different treatment of undefinedness formalized as a UTP theory. In this setting, we show how to use classical lo...
متن کاملLogic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of program specialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. In the specialisation method, a partial evaluation of the proof procedure with respect to a given theory is rst obtained. Secondly an abstract interpretation of the partially evaluated program is computed, and this is...
متن کاملLogic Program Specialisation with Deletion of Useless Clauses 1
In this paper we describe a method of program specialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. In the specialisation method, a partial evaluation of the proof procedure with respect to a given theory is rst obtained. Secondly an abstract interpretation of the partially evaluated program is computed, and this is...
متن کاملNested Abnormality Theories
We propose a new approach to the use of circumscription for representing knowledge. Nested abnormality theories are similar to simple abnormality theories introduced by McCarthy, except that their axioms may have a nested structure , with each level corresponding to another application of the circumscription operator. The new style of applying circumscription sometimes leads to more economical ...
متن کامل